X = ''
for i in range(int(input())):
X+=input()
print("YES" if X==X[::-1] else "NO")#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
char board[n][n];
bool even = true;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> board[i][j];
for (int i = 0; i < n; i++)
{
int c = 0;
for (int j = 0; j < n; j++)
{
if (i - 1 >= 0 and board[i - 1][j] == 'o')
c++;
if (i + 1 < n and board[i + 1][j] == 'o')
c++;
if(j - 1 >= 0 and board[i][j - 1] == 'o')
c++;
if(j + 1 < n and board[i][j + 1] == 'o')
c++;
if (c % 2 == 1)
even = false;
}
}
if (even)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |